A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
نویسندگان
چکیده
منابع مشابه
A Resolution-Based Decision Procedure for SHOIQ
We present a resolution-based decision procedure for the description logic SHOIQ—the logic underlying the Semantic Web ontology language OWL-DL. Our procedure is goal-oriented, and it naturally extends a similar procedure for SHIQ, which has proven itself in practice. Applying existing techniques for deriving saturation-based decision procedures to SHOIQ is not straightforward due to nominals, ...
متن کاملA Decision-Making Procedure for Resolution-Based SAT-Solvers
We describe a new decision-making procedure for resolutionbased SAT-solvers called Decision Making with a Reference Point (DMRP). In DMRP, a complete assignment called a reference point is maintained. DMRP is aimed at finding a change of the reference point under which the number of clauses falsified by the modified point is smaller than for the original one. DMRP makes it possible for a DPLL-l...
متن کاملA Resolution-Based Decision Procedure for Extensions of K4
This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered chaining calculus designed to avoid unnecessary inferences with transitive relations. We show the logics K4, KD4 and S4 can be transformed into a bounded class of well-structured clauses closed under ordered resolution and negati...
متن کاملUsing Resolution as Decision Procedure
This cumulative habilitation thesis is based on five papers related to resolution decision procedures. Resolution is a well-known technique for first-order theorem proving. It is complete, but it does not terminate in general, when there exists no proof. In many cases, resolution can be modified in such a way that it becomes a decision procedure for certain subclasses of first-order logic. We h...
متن کاملResolution Is a Decision Procedure for Many Propositional Modal Logics
The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from propositional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2008
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-008-9100-y